By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Matrix Analysis and Applications

Table of Contents
Search This Issue
Volume 6, Issue 2, pp. 171-344

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Mappings and Facets for Nonabelian Group Problems

Julian Aráoz and Ellis L. Johnson

pp. 171-188

BibTeX  Abstract Full Text:  PDF

Probabilistic Analysis of Geometric Location Problems

Eitan Zemel

pp. 189-200

BibTeX  Abstract Full Text:  PDF

The Effect of the Perturbation of Hermitian Matrices on their Eigenvectors

John DE Pillis and Michael Neumann

pp. 201-209

BibTeX  Abstract Full Text:  PDF

Incremental Processing Applied to Munkres' Algorithm and Its Application in Steinberg's Placement Procedure

H. W. Carter, M. A. Breuer, and Z. A. Syed

pp. 210-219

BibTeX  Abstract Full Text:  PDF

Numerical Solution of Navier–Stokes Problems by the Dual Variable Method

Charles A. Hall

pp. 220-236

BibTeX  Abstract Full Text:  PDF

A Decomposition and Scaling-Inequality for Line-Sum-Symmetric Nonnegative Matrices

George B. Dantzig, B. Curtis Eaves, and Uriel G. Rothblum

pp. 237-241

BibTeX  Abstract Full Text:  PDF

A Note on the Number of Invariant Capital Stocks

Chia-Shin Chung

pp. 242-244

BibTeX  Abstract Full Text:  PDF

Error Bounds for the SSOR Semi-Iterative Method

Lala B. Krishna

pp. 245-250

BibTeX  Abstract Full Text:  PDF

Randomly Near-Traceable Graphs

John Frederick Fink

pp. 251-258

BibTeX  Abstract Full Text:  PDF

Optimal Weighing Designs

Ching-Shui Cheng, Joseph C. Masaro, and Chi Song Wong

pp. 259-267

BibTeX  Abstract Full Text:  PDF

On the Cutwidth and the Topological Bandwidth of a Tree

Fan R. K. Chung

pp. 268-277

BibTeX  Abstract Full Text:  PDF

Optimum Overrelaxation Parameter for the SOR Method for Solving the Eigenvalue Problem

Hideo Sawami and Hiroshi Niki

pp. 278-282

BibTeX  Abstract Full Text:  PDF

Monotonicity and Other Paradoxes in Some Proportional Representation Schemes

Edward M. Bolger

pp. 283-291

BibTeX  Abstract Full Text:  PDF

A Method to Compute Minimal Polynomials

Barbara R, Peskin and David R. Richman

pp. 292-299

BibTeX  Abstract Full Text:  PDF

Disjoint Paths—A Survey

Neil Robertson and P. D. Seymour

pp. 300-305

BibTeX  Abstract Full Text:  PDF

Amortized Computational Complexity

Robert Endre Tarjan

pp. 306-318

BibTeX  Abstract Full Text:  PDF

A Comprehensive Model of Dynamic Programming

Paul Helman and Arnon Rosenthal

pp. 319-334

BibTeX  Abstract Full Text:  PDF

On Discrete Search for a Multiple Number of Objects

Mark Ciancutti

pp. 335-340

BibTeX  Abstract Full Text:  PDF

Solution of the Discrete Lyapunov Equation

Sheau-Wei Fu and Mahmoud E. Sawan

pp. 341-344

BibTeX  Abstract Full Text:  PDF